Linear models for a time-variant permutation generator

نویسنده

  • Jovan Dj. Golic
چکیده

A keystream generator, known as RC4, consisting of a permutation table that slowly varies in time under the control of itself, is analyzed by the linear model approach. The objective is to find linear relations among the keystream bits that hold with probability different from one half by using the linear sequential circuit approximation method. To estimate the corresponding correlation coefficients, some interesting correlation properties of random Boolean functions are derived. It is thus shown that the second binary derivative of the least significant bit output sequence is correlated to 1 with the correlation coefficient close to 15 2 3n where n is the variable word size of RC4. The output sequence length required for the linear statistical weakness detection is then around 64n=225. The result can be used to distinguish RC4 from other keystream generators and to determine the unknown parameter n, as well as for the plaintext uncertainty reduction if n is small.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

MILP models and valid inequalities for the two-machine permutation flowshop scheduling problem with minimal time lags

In this paper, we consider the problem of scheduling on two-machine permutation flowshop with minimal time lags between consecutive operations of each job. The aim is to find a feasible schedule that minimizes the total tardiness. This problem is known to be NP-hard in the strong sense. We propose two mixed-integer linear programming (MILP) models and two types of valid inequalities which aim t...

متن کامل

Cryptanalysis of Two McEliece Cryptosystems Based on Quasi-Cyclic Codes

We cryptanalyse here two variants of the McEliece cryptosystem based on quasi-cyclic codes. Both aim at reducing the key size by restricting the public and secret generator matrices to be in quasi-cyclic form. The first variant considers subcodes of a primitive BCH code. The aforementioned constraint on the public and secret keys implies to choose very structured permutations. We prove that thi...

متن کامل

Haar Matrix Equations for Solving Time-Variant Linear-Quadratic Optimal Control Problems

‎In this paper‎, ‎Haar wavelets are performed for solving continuous time-variant linear-quadratic optimal control problems‎. ‎Firstly‎, ‎using necessary conditions for optimality‎, ‎the problem is changed into a two-boundary value problem (TBVP)‎. ‎Next‎, ‎Haar wavelets are applied for converting the TBVP‎, ‎as a system of differential equations‎, ‎in to a system of matrix algebraic equations‎...

متن کامل

A New High-order Takagi-Sugeno Fuzzy Model Based on Deformed Linear Models

Amongst possible choices for identifying complicated processes for prediction, simulation, and approximation applications, high-order Takagi-Sugeno (TS) fuzzy models are fitting tools. Although they can construct models with rather high complexity, they are not as interpretable as first-order TS fuzzy models. In this paper, we first propose to use Deformed Linear Models (DLMs) in consequence pa...

متن کامل

Delay-Dependent Robust Asymptotically Stable for Linear Time Variant Systems

In this paper, the problem of delay dependent robust asymptotically stable for uncertain linear time-variant system with multiple delays is investigated. A new delay-dependent stability sufficient condition is given by using the Lyapunov method, linear matrix inequality (LMI), parameterized first-order model transformation technique and transformation of the interval uncertainty in to the norm ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 45  شماره 

صفحات  -

تاریخ انتشار 1999